Coded Caching Over Multicast Routing Networks

The coded caching scheme originally proposed by Maddah-Ali and Niesen (MAN) transmits multicast messages from a server to users equipped with caches via capacitated shared-link was shown be information theoretically optimal within constant multiplicative factor. This work extends the MAN class of two-hop wired-wireless networks including one connected fronthaul links layer H helper nodes (access points/base stations), which in turn communicate wireless access network K users, each its own cache. Two variants are considered, differ modeling segment. Both models should regarded as abstractions at “network layer” for physical scenarios such local area cellular networks, spatially distributed over certain coverage area. key our approach consists routing MAN-type through formulating an optimization problem that can solved exactly or we give powerful heuristic algorithms. Our addresses once many open practical problems identified stumbling blocks application scenarios, namely: asynchronous streaming sessions, finite file size, scalability large user mobility random activity (users joining leaving system arbitrary times), decentralized prefetching cache contents, end-to-end encryption HTTPS requests, renders oblivious users' demands.